منابع مشابه
Infinite games with uncertain moves
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore what happens to sets in various levels of the Borel hierarchy under such a situation. We show that the sets at every alternate level of the hierarchy jump to t...
متن کاملRepeated Games with Uncertain Outcomes∗
This paper studies repeated games with imperfect public monitoring where the players are uncertain both about the payoff functions and about the relationship between the distribution of signals and the actions played. We introduce the concept of perfect public ex-post equilibrium (PPXE), and show that it can be characterized with an extension of the techniques used to study perfect public equil...
متن کاملSolving infinite games with bounds
We investigate the existence and the complexity of computing and implementing optimal winning strategies for graph games of infinite duration. Parameterized linear temporal logics are extensions of Linear Temporal Logic (LTL) by temporal operators equipped with variables for time bounds. In model-checking, such specifications were introduced as “PLTL” by Alur et al. and as “PROMPT-LTL” by Kupfe...
متن کاملAlpha-Beta Pruning for Games with Simultaneous Moves
Alpha-Beta pruning is one of the most powerful and fundamental MiniMax search improvements. It was designed for sequential two-player zero-sum perfect information games. In this paper we introduce an Alpha-Beta-like sound pruning method for the more general class of “stacked matrix games” that allow for simultaneous moves by both players. This is accomplished by maintaining upper and lower boun...
متن کاملStrategy Composition in Dynamic Games with Simultaneous Moves
Sometimes, in dynamic games, it is useful to reason not only about the existence of strategies for players, but also about what these strategies are, and how players select and construct them. We study dynamic games with simultaneous moves, repeated normal form games and show that this reasoning can be carried out by considering a single game, and studying composition of “local” strategies. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.112.7